Performance Analysis and Optimal Node-aware Communication for Enlarged Conjugate Gradient Methods

نویسندگان

چکیده

Krylov methods are a key way of solving large sparse linear systems equations but suffer from poor strong scalability on distributed memory machines. This is due to high synchronization costs numbers collective communication calls alongside low computational workload. Enlarged address this issue by decreasing the total iterations convergence, an artifact splitting initial residual and resulting in operations block vectors. In article, we present performance study enlarged method, Conjugate Gradients (ECG), noting impact vectors parallel at scale. Most notably, observe increased overhead point-to-point as result denser messages matrix-block vector multiplication kernel. Additionally, models analyze expected ECG, well motivate design decisions. importantly, introduce new approach based node-aware techniques that increases efficiency method

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal Alternating Direction Implicit Preconditioners for Conjugate Gradient methods

The (Extrapolated) Alternating Direction Implicit Preconditioners for the class of Conjugate Gradient Methods are applied for the solution of the second order elliptic equation in a rectangle under Dirichlet boundary conditions. The PDE is approximated by uniform meshes of 5− and 9−point difference schemes and analytic expressions for the optimal acceleration and extrapolation parameters are ob...

متن کامل

Application of frames in Chebyshev and conjugate gradient methods

‎Given a frame of a separable Hilbert space $H$‎, ‎we present some‎ ‎iterative methods for solving an operator equation $Lu=f$‎, ‎where $L$ is a bounded‎, ‎invertible and symmetric‎ ‎operator on $H$‎. ‎We present some algorithms‎ ‎based on the knowledge of frame bounds‎, ‎Chebyshev method and conjugate gradient method‎, ‎in order to give some‎ ‎approximated solutions to the problem‎. ‎Then we i...

متن کامل

Conjugate Gradient Methods for Toeplitz Systems

A list of technical reports, including some abstracts and copies of some full reports may be found at: Object test coverage using finite state machines. September 1995. On balancing workload in a highly mobile environment. August 1995. Error analysis of a partial pivoting method for structured matrices. June 1995. Abstract In this expository paper, we survey some of the latest developments on u...

متن کامل

Accurate conjugate gradient methods for shifted systems

We present an efficient and accurate variant of the conjugate gradient method for solving families of shifted systems. In particular we are interested in shifted systems that occur in Tikhonov regularization for inverse problems since these problems can be sensitive to roundoff errors. The success of our method in achieving accurate approximations is supported by theoretical arguments as well a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ACM Transactions on Parallel Computing

سال: 2023

ISSN: ['2329-4949', '2329-4957']

DOI: https://doi.org/10.1145/3580003